Lattice Logic Properly Displayed
نویسندگان
چکیده
We introduce a proper display calculus for (non-distributive) Lattice Logic which is sound, complete, conservative, and enjoys cut-elimination and subformula property. Properness (i.e. closure under uniform substitution of all parametric parts in rules) is the main interest and added value of the present proposal, and allows for the smoothest Belnap-style proof of cut-elimination. Our proposal builds on an algebraic and order-theoretic analysis of the semantic environment of lattice logic, and applies the guidelines of the multitype methodology in the design of display calculi.
منابع مشابه
AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملLattices of Modal Logics and Their Groups of Automorphisms
The present paper investigates the groups of automorphisms for some lattices of modal logics. The main results are the following. The lattice of normal extensions of S4.3, NExtS4.3, has exactly two automorphisms, NExtK.alt1 has continuously many automorphisms. Moreover, any automorphism of NExtS4 fixes all logics of finite codimension. We also obtain the following characterization of pretabular...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کامل